C2 Property of Column Finite Matrix Rings

Differential Polynomial Rings of Triangular Matrix Rings

The Complexity of the Word-problem for Finite Matrix Rings

We analyze the so-called word-problem for M2(Z2), the ring of 2 × 2 matrices over Z2. We prove that the term-equivalence problem for the semigroup (and so for the ring) M2(Z2) is coNP-complete.

Matrix product codes over finite commutative Frobenius rings

Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.

differential polynomial rings of triangular matrix rings

Presentations of matrix rings

Recently, there has been a significant interest in the combinatorial properties the ring of n×n matrices. The aim of this note is to describe a short (may be the shortest possible) presentation of the matrix ring Matn(Z). This presentation is significantly shorter than the previously known ones, see [7]. Surprisingly, the number of relations in the presentation does not depend on the size of th...